Note on Decipherability of Three-word Codes
نویسندگان
چکیده
The theory of uniquely decipherable (UD) codes has been widely developed in connection with automata theory, combinatorics on words, formal languages, and monoid theory. Recently, the concepts ofmultiset decipherable (MSD) and set decipherable (SD) codes were developed to handle some special problems in the transmission of information. Unique decipherability is a vital requirement in a wide range of coding applications where distinct sequences of code words carry different information. However, in several applications, it is necessary or desirable to communicate a description of a sequence of events where the information of interest is the set of possible events, including multiplicity, but where the order of occurrences is irrelevant. Suitable codes for these communication purposes need not possess the UD property, but the weaker MSD property. In other applications, the information of interest may be the presence or absence of possible events. The SD property is adequate for such codes. Lempel (1986) showed that the UD andMSDproperties coincide for two-word codes and conjectured that every three-word MSD code is a UD code. Guzmán (1995) showed that the UD, MSD, and SD properties coincide for two-word codes and conjectured that these properties coincide for three-word codes. In an earlier paper (2001), Blanchet-Sadri answered both conjectures positively for all three-word codes {c1,c2,c3} satisfying |c1| = |c2| ≤ |c3|. In this note, we answer both conjectures positively for other special three-word codes. Our procedures are based on techniques related to dominoes.
منابع مشابه
Multiset and Set Decipherable Codes
we extend some results of Lempel and Restive on multiset decipherable codes to set decipherable codes. @ 2001 Elsevier Science Ltd. All rights reserved. Keywords-Codes, Unique decipherability, Multiset decipherability, Dominoes, Set decipherability.
متن کاملDecidability of multiset, set and numerically decipherable directed figure codes
Codes with various kinds of decipherability, weaker than the usual unique decipherability, have been studied since multiset decipherability was introduced in mid-1980s. We consider decipherability of directed figure codes, where directed figures are defined as labelled polyominoes with designated start and end points, equipped with catenation operation that may use a merging function to resolve...
متن کاملReview of 'Information Theory' (Ash, Robert; 1965)
Professor Ash's remark in the Preface that this book was written ". .. in a style suitable for first-year graduate students in mathematics and the physical sciences.. s " should not be taken too seriously. The material is indeed largely self-contained, but the pace and depth of treatment are such that a heavy dose of mathematical maturity is required of the reader. It must be added that this is...
متن کاملCoding Partitions
Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD), we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the “unique decipherability” at the level of the classes of the partition. By tacking into account the natural order between the partitions, we define the c...
متن کامل